Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

Distributed wireless power transfer in sensor networks with multiple Mobile Chargers

We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.     

改进HSR-FCN的服装图像识别分类算法研究

目前网络上的服装图像数量增长迅猛，对于大量服装图像实现智能分类的需求日益增加。将基于区域的全卷积网络（Region-Based Fully Convolutional Networks，R-FCN）引入到服装图像识别中，针对服装图像分类中网络训练时间长、形变服装图像识别率低的问题，提出一种新颖的改进框架HSR-FCN。新框架将R-FCN中的区域建议网络和HyperNet网络相融合，改变图片特征学习方式，使得HSR-FCN可以在更短的训练时间内达到更高的准确率。在模型中引入了空间转换网络，对输入服装图像和特征图进行了空间变换及对齐，加强了对多角度服装和形变服装的特征学习。实验结果表明，改进后的HSR-FCN模型有效地加强了对形变服装图像的学习，且在训练时间更短的情况下，比原来的网络模型R-FCN平均准确率提高了大约3个百分点，达到96.69%。     

Energy-optimal base station density in cellular access networks with sleep modes

Sleep modes are widely accepted as an effective technique for energy-efficient networking: by adequately putting to sleep and waking up network resources according to traffic demands, a proportionality between energy consumption and network utilization can be approached, with important reductions in energy consumption. Previous studies have investigated and evaluated sleep modes for wireless access networks, computing variable percentages of energy savings. In this paper we characterize the maximum energy saving that can be achieved in a cellular wireless access network under a given performance constraint. In particular, our approach allows the derivation of realistic estimates of the energy-optimal density of base stations corresponding to a given user density, under a fixed performance constraint. Our results allow different sleep mode proposals to be measured against the maximum theoretically achievable improvement. We show, through numerical evaluation, the possible energy savings in today’s networks, and we further demonstrate that even with the development of highly energy-efficient hardware, a holistic approach incorporating system level techniques is essential to achieving maximum energy efficiency.     

A precise sensor fault detection technique using statistical techniques for wireless body area networks

One of the major challenges in wireless body area networks (WBANs) is sensor fault detection. This paper reports a method for the precise identification of faulty sensors, which should help users identify true medical conditions and reduce the rate of false alarms, thereby improving the quality of services offered by WBANs. The proposed sensor fault detection (SFD) algorithm is based on Pearson correlation coefficients and simple statistical methods. The proposed method identifies strongly correlated parameters using Pearson correlation coefficients, and the proposed SFD algorithm detects faulty sensors. We validated the proposed SFD algorithm using two datasets from the Multiparameter Intelligent Monitoring in Intensive Care database and compared the results to those of existing methods. The time complexity of the proposed algorithm was also compared to that of existing methods. The proposed algorithm achieved high detection rates and low false alarm rates with accuracies of 97.23% and 93.99% for Dataset 1 and Dataset 2, respectively.     

Specific emitter identification for satellite communication using probabilistic neural networks

Electromagnetic signal emitted by satellite communication (satcom) transmitters are used to identify specific individual uplink satcom terminals sharing the common transponder in real environment, which is known as specific emitter identification (SEI) that allows for early indications and warning (I&W) of the targets carrying satcom furnishment and furthermore the real time electromagnetic situation awareness in military operations. In this paper, the authors are the first to propose the identification of specific transmitters of satcom by using probabilistic neural networks (PNN) to reach the goal of target recognition. We have been devoted to the examination by exploring the feasibility of utilizing the Hilbert transform to signal preprocessing, applying the discrete wavelet transform to feature extraction, and employing the PNN to perform the classification of stationary signals. There are a total of 1000 sampling time series with binary phase shift keying (BPSK) modulation originated by five types of satcom transmitters in the test. The established PNNs classifier implements the data testing and finally yields satisfactory accuracy at 8 dB(±1 dB) carrier to noise ratio, which indicates the feasibility of our method, and even the keen insight of its application in military.     

Application of the Microsoft Excel Solver tool in the solution of optimization problems of heat exchanger network systems

Optimization of heat exchanger networks (HEN_S) is a field of interest in Chemical Engineering. The aim is to use the residual heat of process streams to raise the temperature of other process streams which are cold, thus minimizing the use of hot and cold utilities. The usual way to deal with this task is to pose a linear programming problem according to a transshipment model in order to minimize either the general services consumptions or the number of hot and cold stream matchings required. This optimization is subjected to several restrictions given by the energy balances corresponding to each heat exchange.The high number of variables and equations obliges the use of specific software to solve these problems, e.g. GAMS (General Algebraic Modelling System). However, this software is not intuitive and requires a long time of training and a certain level of practice for the students to adequately use it.This work describes the use of Microsoft Excel-Solver for the sequential solving of HEN_S optimization problems according to the transshipment model. Solver is a much simpler, intuitive and easily available tool for the students who, besides, usually learn how to use it in the first years of their degree, in Informatics or similar subjects. Thus, it is not necessary to spend extra time in the teaching of the software, time that may be devoted to other contents.This paper presents an example of HEN_S problem proposed in the subject Simulation and Optimization of Chemical Processes corresponding to the Joint Master in Chemical Engineering of the Rey Juan Carlos University and the Autónoma University of Madrid and solved by the students using Excel-Solver.     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

User activities and the heterogeneity of urban space:The case of Dahiyat Al Hussein park

Urban researchers have maintained a constant interest in the complexity and continuity of urban space usage. Some have applied actor–network theory (ANT) to investigate the heterogeneity of spaces and present them through the networks of their users’ activities. However, these accounts are predominantly limited in examining the extent to which these spaces may be heterogeneous when exploring such networks. This paper draws on recent ANT scholarship, which employs an ethnographic research conducted in a main park in a housing project at Dahiyat Al Hussein in Amman, Jordan. The findings describe the complex and unpredictable negotiations that occur within spaces by documenting the varieties and interrelations among user activity networks within this common and shared urban space. This research reveals the extent to which spaces, parks in this case, may be heterogeneous by unpacking their usage. The conclusions and insights assert the necessity of paying attention to design detail and creating designs that are responsive to evolving user activities.     

Modeling and analysis of passive worm propagation in the P2P file-sharing network

A number of worms, named P2P (peer-to-peer) passive worms, have recently surfaced, which propagate in P2P file-sharing networks and have posed heavy threats to these networks. In contrast to the majority of Internet worms, it is by exploiting users’ legitimate activities instead of vulnerabilities of networks in which P2P passive worms propagate. This feature evidently slows down their propagation, which results in them not attracting an adequate amount of attention in literature. Meanwhile, this feature visibly increases the difficulty of detecting them, which makes it very possible for them to become epidemic. In this paper, we propose an analytical model for P2P passive worm propagation by adopting epidemiological approaches so as to identify their behaviors and predict the tendency of their propagation accurately. Compared with a few existing models, dynamic characteristics of P2P networks are taken into account. Based on this proposed model, the sufficient condition for the global stability of the worm free equilibrium is derived by applying epidemiological theories. Large scale simulation experiments have validated both the proposed model and the condition.